On Matroids of Branch-Width Three

نویسندگان

  • Rhiannon Hall
  • James G. Oxley
  • Charles Semple
  • Geoff Whittle
چکیده

For all positive integers k, the class Bk of matroids of branch-width at most k is minor-closed. When k is 1 or 2, the class Bk is, respectively, the class of direct sums of loops and coloops, and the class of direct sums of seriesparallel networks. B3 is a much richer class as it contains infinite antichains of matroids and is thus not well-quasi-ordered under the minor order. In this paper, it is shown that, like B1 and B2, the class B3 can be characterized by a finite list of excluded minors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Excluded Minors for Matroids of Branch-Width Three

Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple, G. Whittle, On Matroids of Branch-Width Three, submitted 2001] that if M is an excluded minor for matroids of branch-width 3, then M has at most 14 elements. We show that there are exactly 10 such binary matroids M (...

متن کامل

Monadic second-order model-checking on decomposable matroids

A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the polynomial time model checking of MSOM on representable matroids of bounded branch-width, by reduction to MSO on trees, much simpler than the one previously known. We deduce results about spectrum of MSOM formulas and enumeration on matroids of bounded branch-width. We ...

متن کامل

Amalgam Width of Matroids

We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids, while still allowing the algorithmic application on non-representable matroids (which is not possible for branch-width). In particular, any property expressible in the monadic second order lo...

متن کامل

On Decidability of MSO Theories of Representable Matroids

We show that, for every finite field , the class of all representable matroids of branch-width at most a constant t has a decidable MSO theory. In the other direction, we prove that every class of -representable matroids with a decidable MSO theory must have uniformly bounded branch-width.

متن کامل

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

We prove that a class of matroids representable over a fixed finite field and with bounded branch-width is well-quasi-ordered under taking minors. With some extra work, the result implies Robertson and Seymour’s result that graphs with bounded tree-width (or equivalently, bounded branch-width) are well-quasi-ordered under taking minors. We will not only derive their result from our result on ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 86  شماره 

صفحات  -

تاریخ انتشار 2002